- BatchProcessor<T,S> - Class in edu.claflin.finder.logic.processor
-
Used to process one or multiple objects.
- BatchProcessor() - Constructor for class edu.claflin.finder.logic.processor.BatchProcessor
-
Constructs a BatchProcessor.
- BFS(Map) - Method in class edu.claflin.finder.logic.cygrouper.CytogrouperMain
-
- BipartiteCondition - Class in edu.claflin.finder.logic.cond
-
Represents a bipartite graph as a Condition object.
- BipartiteCondition() - Constructor for class edu.claflin.finder.logic.cond.BipartiteCondition
-
- bipartiteDivision(Graph) - Static method in class edu.claflin.finder.logic.BronKerboschBipartiteUtils
-
Divides the given graph into bipartite sets.
- booleanList - Variable in class edu.claflin.finder.algo.ArgumentsBundle
-
The Mapping of String keywords to Notable Boolean values.
- BreadthFirstTraversalSearch - Class in edu.claflin.finder.algo
-
Processes a
Graph searching for subgraphs by performing a breadth
first search on each node of the graph.
- BreadthFirstTraversalSearch(ArgumentsBundle) - Constructor for class edu.claflin.finder.algo.BreadthFirstTraversalSearch
-
Public constructor for initializing the BreadthFirstTraversalSearch with
default conditions.
- bronKerbosch(Graph) - Static method in class edu.claflin.finder.logic.BronKerboschHandler
-
Given a graph, finds all complete subgraphs.
- bronKerbosch(ArrayList<Graph>, Graph, Graph, Graph) - Static method in class edu.claflin.finder.logic.BronKerboschHandler
-
Recursive helper method to do the above.
- bronKerboschBipartite(Graph) - Static method in class edu.claflin.finder.logic.BronKerboschHandler
-
Bipartite Bron Kerbosch algorithm that usees the above to find all complete bipartite graphs
within a bipartite graph.
- BronKerboschBipartiteUtils - Class in edu.claflin.finder.logic
-
Provides methods to mark graphs as bipartite using the basic Graph, Edge, and Node classes.
- BronKerboschBipartiteUtils() - Constructor for class edu.claflin.finder.logic.BronKerboschBipartiteUtils
-
- BronKerboschHandler - Class in edu.claflin.finder.logic
-
Code for finding maximal clique of a graph using the Bron-Kerbosch algorithm.
- BronKerboschHandler() - Constructor for class edu.claflin.finder.logic.BronKerboschHandler
-
- Bundle - Class in edu.claflin.finder.algo
-
Processes a
Graph searching for subgraphs.
- Bundle(Algorithm[]) - Constructor for class edu.claflin.finder.algo.Bundle
-
Constructs the Algorithm object.
- bW - Variable in class edu.claflin.finder.log.LogUtil
-
The BufferedWriter used to log to a file.